package com.tang.algorithm.array;

/**
 * @author tlm
 * @version 1.0
 * @date 2020/6/3 0:02
 */
public class LeetCode1450 {
    public int busyStudent(int[] startTime, int[] endTime, int queryTime) {
        int count = 0;
        for (int i = 0; i <startTime.length ; i++) {
            if(queryTime>=startTime[i] && queryTime <= endTime[i]) count++;
        }
        return count;
    }
}
